A theorem of the maximin and applications to Bayesian zero-sum games
نویسندگان
چکیده
Consider a family of zero-sum games indexed by a parameter that determines each player’s payoff function and feasible strategies. Our first main result characterizes continuity assumptions on the payoffs and the constraint correspondence such that the equilibrium value and strategies depend continuously and upper hemicontinuously (respectively) on the parameter. This characterization uses two topologies in order to overcome a topological tension that arises when players’ strategy sets are infinite-dimensional. Our secondmain result is an application to Bayesian zero-sum games in which each player’s information is viewed as a parameter. We model each player’s information as a sub-σ-field, so that it determines her feasible strategies: those that are measurable with respect to the player’s information. We thereby characterize conditions under which the equilibrium value and strategies depend continuously andupper hemicontinuously (respectively) on eachplayer’s information. This clarifies and extends related results of Einy et al. (2008).
منابع مشابه
A TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS
In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...
متن کاملMaximin Play in Two-Person Bimatrix Games
Since the seminal paper of Nash [7] game theoretic literature has focused mostly on equilibrium and not on maximin (minimax) strategies. We study the properties of these strategies in 2-player non-zero-sum strategic games, whose Nash equilibria are only mixed.
متن کاملA Class of Two-Person Zero-Sum Matrix Games with Rough Payoffs
We concentrate on discussing a class of two-person zero-sum games with rough payoffs. Based on the expected value operator and the trust measure of rough variables, the expected equilibrium strategy and r-trust maximin equilibrium strategy are defined. Five cases whether the game exists r-trust maximin equilibrium strategy are discussed, and the technique of genetic algorithm is applied to find...
متن کاملA strong convergence theorem for solutions of zero point problems and fixed point problems
Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated. A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces.
متن کاملThompson Sampling for Monte Carlo Tree Search and Maxi-min Action Identification
The Multi-Armed Bandit(MAB) problem is named after slot machine games. When playing slot machines, one player has to decide which machine to play, in which order to play them and how many times to play each machine. After the choice, that specific machine will offer a random reward from a probability distribution, and the player’s target is to maximize the sum of rewards earned through a sequen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Game Theory
دوره 40 شماره
صفحات -
تاریخ انتشار 2011